Data Structures and Algorithms for Extended State Space and Structural Level Reduction of the GSPN Model

نویسندگان

  • Donna S. Nielsen
  • Leonard Kleinrock
چکیده

This paper extends the applicability of exact analysis of the GSPN model by providing methods to improve the time and space complexity of both state space and structural level reduction. For state space level reduction, we maximize the concurrent firing of immediate transitions. For structural level reduction, we minimize the number of generated replicas for timed transitions by using branch and bound techniques to create concurrent replicas that simulate the firing of the timed transition followed by the simultaneously firing of multiple immediate transitions. 1 I n t r o d u c t i o n State space level reduction techniques eliminate vanishing markings by concurrently firing multiple immediate transitions in a single state space transition [1, 4]. Structural level reduction techniques eliminate immediate transitions, the source of vanishing markings, by iteratively creating replicas of a timed transition to simulate the firing of the timed transition followed by the firing of an immediate transition [2, 6]. This paper provides data structures and algorithms to extend the applicabili ty and to efficiently implement both state space and structural level reduction of the GSPN model. With respect to state state space level reduction, we rely on knowledge of the given marking, as well as the GSPN structure, to maximize the concurrent firing of immediate transitions. In addition, we develop efficient algorithms to generate the concurrent transition firing combinations and their corresponding firing probabilities. With respect to structural level reduction, we avoid the generation of redundant replicas by applying state space level reduction techniques at the structural level to generate concurrent replicas which simulate the firing of a timed transition followed by the concurrent firing of multiple immediate transitions. In addition, we use branch and bound techniques to both This work was sponsored by the Advanced Research Projects Agency of the U.S. Department of Defense under Contract MDA 972-91=J-1011, Advanced Networking and Distributed Systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Simulated Annealing and Electromagnetic Algorithms for Solution of Extended Portfolio Model

This paper presents two meta-heuristic algorithms to solve an extended portfolio selection model. The extended model is based on the Markowitz's Model, aiming to minimize investment risk in a specified level of return. In order to get the Markowitz model close to the real conditions, different constraints were embedded on the model which resulted in a discrete and non-convex solution space. ...

متن کامل

A Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses

In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...

متن کامل

Assessment of the conventional control algorithms and proposing a modified displacement feedback control for performance-based design of structures

An enhanced displacement feedback structural control procedure is presented for performance-based design in this paper. At first, a comparative study is implemented assessing three most common active control algorithms including state, acceleration, and displacement feedback controls. The advantage of the displacement feedback algorithm for active control of structures against earthquakes is de...

متن کامل

Nonlinear System Identification Using Hammerstein-Wiener Neural Network and subspace algorithms

Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsyst...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994